Knapsack Cipher and Cryptanalyst Using Heuristic Methods
نویسنده
چکیده
This paper describes a method of a cryptanalyst for a knapsack cipher. The deciphering method is based on the application of a heuristic random search hill-climbing algorithm, together with a genetic algorithm. It is shown that such an algorithm, implemented in Matlab environment, could be used to break a knapsack cipher. Some other aspects of the problem are discussed, too.
منابع مشابه
Cryptanalysis of a quadratic knapsack cryptosystem
Wang and Hu [B. Wang and Y. Hu, Quadratic compact knapsack public-key cryptosystem, Comput. Math. Appl. 59 (1) (2010) 194–206] proposed a knapsack-type public-key cryptosystem by introducing an easy quadratic compact knapsack problem and then using the Chinese remainder theorem to disguise the easy knapsack instant. In this paper, we present a heuristic stereotyped message attack that allows th...
متن کاملGenetic Algorithm solution for Cryptanalysis of Knapsack Cipher with Knapsack Sequence of Size 16
With growth of networked systems and applications such as ecommerce, the demand for internet security is increasing. Information can be secured using cryptography, anti-virus, malwares, spywares, firewall etc. In cryptology, cryptanalysis is a discipline where the ciphers are attacked and broke thus enabling the developers to strengthen the cipher. Nowadays cryptanalysis of ciphers is gaining p...
متن کاملClassification of Substitution Ciphers using Neural Networks
Most of the time of a cryptanalyst is spent on finding the cipher technique used for encryption rather than the finding the key/ plaintext of the received cipher text. The Strength of the classical substitution cipher‟s success lie on the variety of characters employed to represent a single character. More, the characters employed more the complexity. Thus, in order to reduce the work of the cr...
متن کاملNon-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear approximations often exhibit greater absolute biases than linear ones, so it would appear that more powerful attacks may be mounted. However, their use presents two main drawbacks. The first is that in the general case no jo...
متن کاملLength-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionally, knapsack constraints have been studied with respect to the required and possible set domain representation. For this domainstore efficient filtering algorithms achieving relaxed and approximated consistency are kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003